Supervised Texture Segmentation by Maximising Conditional Likelihood
نویسنده
چکیده
Supervised segmentation of piecewise-homogeneous image textures using a modified conditional Gibbs model with multiple pairwise pixel interactions is considered. The modification takes into account that interregion interactions are usually different for the training sample and test images. Parameters of the model learned from a given training sample include a characteristic pixel neighbourhood specifying the interaction structure and Gibbs potentials giving quantitative strengths of the pixelwise and pairwise interactions. The segmentation is performed by approaching the maximum conditional likelihood of the desired region map provided that the training and test textures have similar conditional signal statistics for the chosen pixel neighbourhood. Experiments show that such approach is more efficient for regular textures described by different characteristic long-range interactions than for stochastic textures with overlapping close-range neighbourhoods. 1 Center for Image Technology and Robotics Tamaki Campus, The University of Auckland, Auckland, New Zealand. [email protected] You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the CITR Tamaki web site under terms that include this permission. All other rights are reserved by the author(s). Supervised Texture Segmentation by Maximising Conditional Likelihood
منابع مشابه
Segmentation of monochrome and color textures using moving average modeling approach
The segmentation of textures using features extracted with 2-D moving average (MA) modeling approach is presented in this paper. The 2-D MA model represents a texture as an output of a 2-D nite impulse response (FIR) lter with simple input process. The 2-D MA model is exible, and can be used for modeling both isotropic and anisotropic textures. The maximum-likelihood (ML) estimators of the 2-D ...
متن کاملUnsupervised Texture Image Segmentation Using MRFEM Framework
Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...
متن کاملUnsupervised Texture Image Segmentation Using MRFEM Framework
Texture image analysis is one of the most important working realms of image processing in medical sciences and industry. Up to present, different approaches have been proposed for segmentation of texture images. In this paper, we offered unsupervised texture image segmentation based on Markov Random Field (MRF) model. First, we used Gabor filter with different parameters’ (frequency, orientatio...
متن کاملUnsupervised Bayesian image segmentation using wavelet-domain hidden Markov models
In this paper, we study unsupervised image segmentation using wavelet-domain hidden Markov models (HMMs). We first review recent supervised Bayesian image segmentation algorithms using wavelet-domain HMMs. Then, a new unsupervised segmentation approach is developed by capturing the likelihood disparity of different texture features with respect to wavelet-domain HMMs. The K-mean clustering is u...
متن کاملClosed-Form Training of Conditional Random Fields for Large Scale Image Segmentation
We present LS-CRF, a new method for very efficient large-scale training of Conditional Random Fields (CRFs). It is inspired by existing closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. LS-CRF training requires only solving a set of independent regression problems, for which closed-form expression as well as efficient iterative sol...
متن کامل